Tootfinder

On the existence of $\delta$-temporal cliques in random simple temporal graphs
George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis
https://arxiv.org/abs/2404.07147

On the existence of $δ$-temporal cliques in random simple temporal graphs
We consider random simple temporal graphs in which every edge of the complete graph $K_n$ appears once within the time interval [0,1] independently and uniformly at random. Our main result is a sharp threshold on the size of any maximum $δ$-clique (namely a clique with edges appearing at most $δ$ apart within [0,1]) in random instances of this model, for any constant~$δ$. In particular, using the probabilistic method, we prove that the size of a maximum $δ$-clique is approximately $\frac{2\…

Complex network approach to the turbulent velocity gradient dynamics: High- and low-probability Lagrangian paths
Christopher J. Keylock, Maurizio Carbone
https://arxiv.org/abs/2404.05453

Complex network approach to the turbulent velocity gradient dynamics: High- and low-probability Lagrangian paths
Understanding the dynamics of the turbulent velocity gradient tensor (VGT) is essential to gain insights into the Navier-Stokes equations and improve small-scale turbulence modeling. However, characterizing the VGT dynamics conditional on all its relevant invariants in a continuous fashion is extremely difficult. In this paper, we represent the VGT Lagrangian dynamics using a network where each node represents a unique flow state. This approach enables us to discern how the VGT transitions from…

Equivalence and Similarity Refutation for Probabilistic Programs
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotn\'y, {\DJ}or{\dj}e \v{Z}ikeli\'c
https://arxiv.org/abs/2404.03430

Equivalence and Similarity Refutation for Probabilistic Programs
We consider the problems of statically refuting equivalence and similarity of output distributions defined by a pair of probabilistic programs. Equivalence and similarity are two fundamental relational properties of probabilistic programs that are essential for their correctness both in implementation and in compilation. In this work, we present a new method for static equivalence and similarity refutation. Our method refutes equivalence and similarity by computing a function over program outpu…

This https://arxiv.org/abs/2403.01829 has been replaced.
link: https://scholar.google.com/scholar?q=a

OnePerc: A Randomness-aware Compiler for Photonic Quantum Computing
The photonic platform holds great promise for quantum computing. Nevertheless, the intrinsic probabilistic characteristics of its native fusion operations introduces substantial randomness into the computing process, posing significant challenges to achieving scalability and efficiency in program execution. In this paper, we introduce a randomness-aware compilation framework designed to concurrently achieve scalability and efficiency. Our approach leverages an innovative combination of offline …

I know that Elsa was probably pretty annoyed with her and the whole "Want to make a snowman" thing, but this seems completely uncalled for.

Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling
Xumei Xi, Christina Lee Yu, Yudong Chen
https://arxiv.org/abs/2403.00184

Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling
Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying probabilities, potentially with different asymptotic scalings. We show that under structured sampling probabilities, it is often better and sometimes optimal to run estimation algorithms on a smaller submatrix rather than the entire matrix. In particular, we prove error …

This https://arxiv.org/abs/2304.08358 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Integral representation of functions on the circle
We give a complete characterization of all real-valued functions on the unit circle $S^1$ that can be represented by integrating the spherical distance on $S^1$ with respect to a signed measure or a probability measure.

I know that Elsa was probably pretty annoyed with her and the whole "Want to make a snowman" thing, but this seems completely uncalled for.

This https://arxiv.org/abs/2312.14139 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Quasi-Probabilistic Readout Correction of Mid-Circuit Measurements for Adaptive Feedback via Measurement Randomized Compiling
Quantum measurements are a fundamental component of quantum computing. However, on modern-day quantum computers, measurements can be more error prone than quantum gates, and are susceptible to non-unital errors as well as non-local correlations due to measurement crosstalk. While readout errors can be mitigated in post-processing, it is inefficient in the number of qubits due to a combinatorially-large number of possible states that need to be characterized. In this work, we show that measureme…

Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling
Xumei Xi, Christina Lee Yu, Yudong Chen
https://arxiv.org/abs/2403.00184

Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling
Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying probabilities, potentially with different asymptotic scalings. We show that under structured sampling probabilities, it is often better and sometimes optimal to run estimation algorithms on a smaller submatrix rather than the entire matrix. In particular, we prove error …